A Euclid style algorithm for MacMahon's partition analysis

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A partition-based algorithm for clustering large-scale software systems

Clustering techniques are used to extract the structure of software for understanding, maintaining, and refactoring. In the literature, most of the proposed approaches for software clustering are divided into hierarchical algorithms and search-based techniques. In the former, clustering is a process of merging (splitting) similar (non-similar) clusters. These techniques suffered from the drawba...

متن کامل

A Fast Algorithm for MacMahon's Partition Analysis

This paper deals with evaluating constant terms of a special class of rational functions, the Elliott-rational functions. The constant term of such a function can be read off immediately from its partial fraction decomposition. We combine the theory of iterated Laurent series and a new algorithm for partial fraction decompositions to obtain a fast algorithm for MacMahon’s Omega calculus, which ...

متن کامل

Euclid ’ s Algorithm Andrzej

The main goal of the paper is to prove the correctness of the Euclid’s algorithm for SCM. We define the Euclid’s algorithm and describe the natural semantics of it. Eventually we prove that the Euclid’s algorithm computes the Euclid’s function. Let us observe that the Euclid’s function is defined as a function mapping finite partial states to finite partial states of SCM rather than pairs of in...

متن کامل

The Mixed Binary Euclid Algorithm

We present a new GCD algorithm for two integers that combines both the Euclidean and the binary gcd approaches. We give its worst case time analysis and prove that its bit-time complexity is still O(n) for two n-bit integers. However, our preliminar experiments show that it is very fast for small integers. A parallel version of this algorithm matches the best presently known time complexity, na...

متن کامل

Andrews Style Partition Identities

We propose a method to construct a variety of partition identities at once. The main application is an all-moduli generalization of some of Andrews’ results in [5]. The novelty is that the method constructs solutions to functional equations which are satisfied by the generating functions. In contrast, the conventional approach is to show that a variant of well-known series satisfies the system ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Combinatorial Theory, Series A

سال: 2015

ISSN: 0097-3165

DOI: 10.1016/j.jcta.2014.11.006